Model Checking Algorithms for CTMDPs
نویسندگان
چکیده
Continuous Stochastic Logic (CSL) can be interpreted over continuoustime Markov decision processes (CTMDPs) to specify quantitative properties of stochastic systems that allow some external control. Model checking CSL formulae over CTMDPs requires then the computation of optimal control strategies to prove or disprove a formula. The paper presents a conservative extension of CSL over CTMDPs—with rewards—and exploits established results for CTMDPs for model checking CSL. A new numerical approach based on uniformization is devised to compute time bounded reachability results for time dependent control strategies. Experimental evidence is given showing the efficiency of the approach.
منابع مشابه
Model checking nondeterministic and randomly timed systems
Formalmethods initially focused on themathematically precise specication, design and analysis of functional aspects of soware and hardware systems. In this context, model checking has proved to be tremendously successful in analyzing qualitative properties of distributed systems. is observation has encouraged people in the eld of performance and dependability evaluation to extend existing mo...
متن کاملA Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness
Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...
متن کاملQuantitative Analysis of Concurrent System Architectures
Safety-critical software and systems development is subject to special dependability requirements. Early analysis of dependability during design and development phase is often a statutory condition for the approval of technical systems. In order to support the developers in verifying and analysing these systems the QuantUM tool was recently introduced [31]. The UML model of the system can be an...
متن کاملAnalysis and scheduler synthesis of time - bounded reachability in continuous - time Markov decision processes
Continuous-time Markov decision processes (CTMDPs) are stochastic models in which probabilistic and nondeterministic choices co-exist. Lately, a discretization technique has been developed to compute time-bounded reachability probabilities in locally uniform CTMDPs, i.e. CTMDPs with state-wise constant sojourn-times. We extend the underlying value iteration algorithm, such that it computes an -...
متن کاملPlaying Optimally on Timed Automata with Random Delays
We marry continuous time Markov decision processes (CTMDPs) with stochastic timed automata into a model with joint expressive power. This extension is very natural, as the two original models already share exponentially distributed sojourn times in locations. It enriches CTMDPs with timing constraints, or symmetrically, stochastic timed automata with one conscious player. Our model maintains th...
متن کامل